A fast algorithm for approximate polynomial gcd based on structured matrix computations
نویسندگان
چکیده
An O(n) complexity algorithm for computing an 2-greatest common divisor (gcd) of two polynomials of degree at most n is presented. The algorithm is based on the formulation of polynomial gcd given in terms of resultant (Bézout, Sylvester) matrices, on their displacement structure and on the reduction of displacement structured matrices to Cauchy-like form originally pointed out by Georg Heinig. A Matlab implementation is provided. Numerical experiments performed with a wide variety of test problems, show the effectiveness of this algorithm in terms of speed, stability and robustness, together with its better reliability with respect to the available software. Mathematics Subject Classification (2000). Da mettere.
منابع مشابه
Displacement Structure in Computing Approximate Gcd of Univariate Polynomials
We propose a fast algorithm for computing approximate GCD of univariate polynomials with coefficients that are given only to a finite accuracy. The algorithm is based on a stabilized version of the generalized Schur algorithm for Sylvester matrix and its embedding. All computations can be done in O(n2) operations, where n is the sum of the degrees of polynomials. The stability of the algorithm ...
متن کاملFast Low Rank Approximation of a Sylvester Matrix by Structured Total Least Norm
The problem of approximating the greatest common divisor(GCD) for polynomials with inexact coefficients can be formulated as a low rank approximation problem with a Sylvester matrix. In this paper, we present an algorithm based on fast Structured Total Least Norm(STLN) for constructing a Sylvester matrix of given lower rank and obtaining the nearest perturbed polynomials with exact GCD of given...
متن کاملStructured Low Rank Approximation of a Bezout Matrix
The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given Bezout matrix a new Bezout matrix of lower rank whose entries are near the corresponding entries of that input matrix. We present an algorithm based on a version of structured nonlinear total least squares (SNTLS) meth...
متن کاملGeneralized companion matrix for approximate GCD
We study a variant of the univariate approximate GCD problem, where the coefficients of one polynomial f(x)are known exactly, whereas the coefficients of the second polynomial g(x)may be perturbed. Our approach relies on the properties of the matrix which describes the operator of multiplication by gin the quotient ring C[x]/(f). In particular, the structure of the null space of the multiplicat...
متن کاملStructured Low Rank Approximation of a Sylvester Matrix
The task of determining the approximate greatest common divisor (GCD) of univariate polynomials with inexact coefficients can be formulated as computing for a given Sylvester matrix a new Sylvester matrix of lower rank whose entries are near the corresponding entries of that input matrix. We solve the approximate GCD problem by a new method based on structured total least norm (STLN) algorithms...
متن کامل